A note on syndeticity, recognizable sets and Cobham's theorem
نویسندگان
چکیده
In this note, we give an alternative proof of the following result. Let p, q ≥ 2 be two multiplicatively independent integers. If an infinite set of integers is both pand q-recognizable, then it is syndetic. Notice that this result is needed in the classical proof of the celebrated Cobham’s theorem. Therefore the aim of this paper is to complete [13] and [1] to obtain an accessible proof of Cobham’s theorem.
منابع مشابه
LOGIC AND p-RECOGNIZABLE SETS OF INTEGERS
We survey the properties of sets of integers recognizable by automata when they are written in p-ary expansions. We focus on Cobham’s theorem which characterizes the sets recognizable in different bases p and on its generalization to Nm due to Semenov. We detail the remarkable proof recently given by Muchnik for the theorem of Cobham-Semenov, the original proof being published in Russian.
متن کاملA Note on Recognizable Sets of Unranked and Unordered Trees
Recognizable sets of unranked, unordered trees have been introduced in Courcelle [C89] in a Myhill-Nerode [N58] style of inverse homomorphisms of suitable finite magmas. This is equivalent of being the the union of some congruence classes of a congruence of finite index. We will add to the well-known concept of regular tree grammars a handling of nodes labeled with ǫ. With this rather unconvent...
متن کاملA Generalization of Cobham's Theorem to Automata over Real Numbers
This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in the first-order additive theory of real and integer variables 〈R, Z,+, <〉 can all be recognized by weak deterministic Büchi automata, regardless of the encoding base r > 1. In this paper, we prove the reciprocal property, i.e., t...
متن کاملA note on approximation conditions, standard triangularizability and a power set topology
The main result of this article is that for collections of entry-wise non-negative matrices the property of possessing a standard triangularization is stable under approximation. The methodology introduced to prove this result allows us to offer quick proofs of the corresponding results of [B. R. Yahaghi, Near triangularizability implies triangularizability, Canad. Math. Bull. 47, (2004), no. 2...
متن کاملLanguage of General Fuzzy Recognizer
In this note first by considering the notion of general fuzzy automata (for simplicity GFA), we define the notions of direct product, restricted direct product and join of two GFA. Also, we introduce some operations on (Fuzzy) sets and then prove some related theorems. Finally we construct the general fuzzy recognizers and recognizable sets and give the notion of (trim) reversal of a given GFA....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bulletin of the EATCS
دوره 88 شماره
صفحات -
تاریخ انتشار 2006